Comparative Performance Analysis of Rnsc and Mcl Algorithms on Power-law Distribution
نویسندگان
چکیده
Cluster analysis of graph related problems is an important issue now-a-day. Different types of graph clustering techniques are appeared in the field but most of them are vulnerable in terms of effectiveness and fragmentation of output in case of real-world applications in diverse systems. In this paper, we will provide a comparative behavioural analysis of RNSC (Restricted Neighbourhood Search Clustering) and MCL (Markov Clustering) algorithms on Power-Law Distribution graphs. RNSC is a graph clustering technique using stochastic local search. RNSC algorithm tries to achieve optimal cost clustering by assigning some cost functions to the set of clusterings of a graph. This algorithm was implemented by A. D. King only for undirected and unweighted random graphs. Another popular graph clustering algorithm MCL is based on stochastic flow simulation model for weighted graphs. There are plentiful applications of power-law or scale-free graphs in nature and society. Scale-free topology is stochastic i.e. nodes are connected in a random manner. Complex network topologies like World Wide Web, the web of human sexual contacts, or the chemical network of a cell etc., are basically following power-law distribution to represent different real-life systems. This paper uses real large-scale power-law distribution graphs to conduct the performance analysis of RNSC behaviour compared with Markov clustering (MCL) algorithm. Extensive experimental results on several synthetic and real power-law distribution datasets reveal the effectiveness of our approach to comparative performance measure of these algorithms on the basis of cost of clustering, cluster size, modularity index of clustering results and normalized mutual information (NMI).
منابع مشابه
Performance Testing of RNSC and MCL Algorithms on Random Geometric Graphs
The exploration of quality clusters in complex networks is an important issue in many disciplines, which still remains a challenging task. Many graph clustering algorithms came into the field in the recent past but they were not giving satisfactory performance on the basis of robustness, optimality, etc. So, it is most difficult task to decide which one is giving more beneficial clustering resu...
متن کاملAn Effective Comparison of Graph Clustering Algorithms via Random Graphs
Many graph clustering algorithms have been proposed in recent past researches, each algorithm having its own advantages and drawbacks. All these algorithms rely on a very different approach so it’s really hard to say that which one is the most efficient and optimal if we talk in the sense of performance. It is really hard to decide that which algorithm is beneficial in case of highly complex ne...
متن کاملA critical Comparison of Graph Clustering Algorithms Using the K-clique Percolation Technique
In the recent past, various graph clustering algorithms have been proposed. Each algorithm has its own behaviour in terms of performance on a specific data set. So, it is really hard to tell which one is the most efficient and optimal. The concept of k-clique percolation technique in random networks is introduced where k is the size of the complete sub-graphs that are organized into large scale...
متن کاملOptimal Reconfiguration of Distribution Network for Power Loss Reduction and Reliability Improvement Using Bat Algorithm
In power systems, reconfiguration is one of the simplest and most low-cost methods to reach many goals such as self-healing, reliability improvement, and power loss reduction, without including any additional components. Regarding the expansion of distribution networks, communications become more complicate and the number of parameters increases, which makes the reconfiguration problem infeasib...
متن کاملFrequency Analysis of FG Sandwich Rectangular Plates with a Four-Parameter Power-Law Distribution
An accurate solution procedure based on the three-dimensional elasticity theory for the free vibration analysis of Functionally Graded Sandwich (FGS) plates is presented. Since no assumptions on stresses and displacements have been employed, it can be applied to the free vibration analysis of plates with arbitrary thickness. The two-constituent FGS plate consists of ceramic and metal graded thr...
متن کامل